Commensurability of automorphism groups

AUTOMORPHISM GROUP OF GROUPS OF ORDER pqr

H"{o}lder in 1893 characterized all groups of order $pqr$ where  $p>q>r$ are prime numbers. In this paper,  by using new presentations of these groups, we compute their full automorphism group.

AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...

Commensurability riteria for Kleinian groups

Commensurability of Fuchsian Groups and Their Axes

Theorem. For each arithmetic Fuchsian group Γ, there exists an infinite order elliptic element e such that e(ax(Γ)) = ax(Γ). Recall that a Fuchsian group is a discrete subgroup of PSL2(R) ∼= isom(H). We denote by ax(Γ) the set of axes of hyperbolic elements of the Fuchsian group Γ. The proof follows easily from known properties of arithmetic Fuchsian groups. Recall that an arithmetic Fuchsian g...

NILPOTENCY AND SOLUBILITY OF GROUPS RELATIVE TO AN AUTOMORPHISM

In this paper we introduce the concept of α-commutator which its definition is based on generalized conjugate classes. With this notion, α-nilpotent groups, α-solvable groups, nilpotency and solvability of groups related to the automorphism are defined. N(G) and S(G) are the set of all nilpotency classes and the set of all solvability classes for the group G with respect to different automorphi...